improved skips for faster postings list intersection
Authors
abstract
information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. the document processor, matching function and query analyzer are the main components of an information retrieval system. document retrieval system is fundamentally based on: boolean, vector-space, probabilistic, and language models. in this paper, a new methodology for matching function of boolean retrieval systems is proposed and tried to extend postings list data structures and increase the efficiency of using postings lists and skips. the final effect of these considerations is in decreasing the search time.
similar resources
Improved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
full textImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
full textIntegrating Skips and Bitvectors for List Intersection
This thesis examines space-time optimizations of in-memory search engines. Search engines can answer queries quickly, but this is accomplished using significant resources in the form of multiple machines running concurrently. Improving the performance of search engines means reducing the resource costs, such as hardware, energy, and cooling. These saved resources can then be used to improve the...
full textFaster Triangle-Triangle Intersection Tests
This paper presents a new method for computing whether or not two triangles in three dimensions intersect. The code is very efficient and requires minimum arithmetic precision. Indeed, all branching decisions are carried out by evaluating the signs of degree three polynomials. In addition, an efficient test is proposed for the two-dimensional case. Key-words: geometric predicates, low degree pr...
full textImproving the Performance of List Intersection
List intersection is a central operation, utilized excessively for query processing on text and databases. We present list intersection algorithms for an arbitrary number of sorted and unsorted lists tailored to the characteristics of modern hardware architectures. Two new list intersection algorithms are presented for sorted lists. The first algorithm, termed Dynamic Probes, dynamically decide...
full textExploiting Skips In Periodic Tasks For Enhancing
In certain real-time applications, ranging from multimedia to telecommunication systems , timing constraints can be more exible than scheduling theory usually permits. For example, in video reception, missing a deadline is acceptable, provided that most deadlines are met. In this paper, we deal with the problem of scheduling hybrid sets of tasks, consisting of rm periodic tasks (i.e., tasks wit...
full textMy Resources
Save resource for easier access later
Journal title:
journal of advances in computer researchجلد ۳، شماره ۳، صفحات ۱-۸
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023